Automatic hoisting and transporting method for tower crane

ABSTRACT

Disclosed is an automatic hoisting and transporting method for a tower crane, the method including: building a three-dimensional grid model for a construction site, and generating a grid node set; generating an obstacle node set and a feasible area node set; obtaining coordinates of an initial node and an end node; planning a hoisting and transporting path from the initial node to the end node, and generating corresponding operating parameters; controlling the tower crane to transport an object according to the operating parameters, and calculating a swing range of the hoisted and transported object and a swing arm at a current position; determining whether a collision may occur; and predicting whether the tower crane may be overturned. The method realizes automatic hoisting and transporting of the tower crane. The object does not collide with an obstacle during hoisting and transporting, thereby ensuring safe operation of the tower crane.

TECHNICAL FIELD

The present invention relates to the technical field of automatic control of tower cranes, in particular to an automatic hoisting and transporting method for a tower crane.

BACKGROUND

Tower cranes are key mechanical equipment in construction work, and can be seen everywhere in building construction sites, which can effectively save manpower, reduce construction costs and improve construction efficiency. Due to the high position of a cab in a tower crane, the field of view of a tower crane operator is greatly limited. In addition, there are buildings and obstacles in the site, which often lead to blind hoisting and blocked hoisting. A driver can only work by experience in combination with instructions of surface personnel, such that it is very blind and difficult to operate, and there are certain potential safety hazards. Meanwhile, the tower crane driver is prone to fatigue after repeating work for a long time in the small high-altitude cab, resulting in a great impact on safe production in hoisting and transporting operation of the tower crane. In order to solve this problem, an existing technology provides assistance for the driver mainly by arranging a tower crane operation monitoring system and acquiring operating parameters and video images of the tower crane to reduce visual blind zones. Tower crane driving is greatly affected by human factors, so the problem of driver fatigue driving still exists. As a result, an unmanned tower crane is an important direction for the research and development of new tower cranes.

Path planning and collision avoidance need to be taken into account for the realization of unmanned driving of tower cranes. According to a control method and an intelligent system for an unmanned tower crane designed in an invention patent application CN110182696A, a transport trajectory is generated by acquiring a real-time map where the tower crane is located, and intelligent obstacle avoidance is performed by using a simultaneous localization and mapping (SLAM) algorithm, a perception algorithm and other methods to achieve automatic control of the tower crane, but there is no specific technical solutions for the realization of hoisting and transporting path planning. According to a two-dimensional code-based automatic control system and control method for a tower crane designed in an invention patent application CN110482409A, it is proposed to search for a hoisting and transporting path by using a rapidly exploring random tree (RRT) algorithm, which can rapidly obtain a feasible path from an initial node to an end node, but this path is not necessarily an optimal path. According to a machine vision-based navigation method for prefabricated building construction proposed in an invention patent application CN109610850A, an implementation mode for calculating a hoisting and transporting path by using an ant colony algorithm is proposed. At present, an anti-collision technology for a tower crane mainly includes a video monitoring technology and sensor monitoring. A current video monitoring technology is not targeted and is only used for live image recording of a tower crane, such that image data information is not fully utilized for analysis, and a tower crane operator cannot be directly guided in operation or automatic operation cannot be realized. In a sensor monitoring mode, due to the restriction on installation of sensors at some key parts of a boom and a pull rod of a tower crane, setting of monitoring nodes is limited, such that the sensor-based monitoring mode has limited monitoring capability, obtained information is only limited to some sensitive technical parameters, and more comprehensive and intuitive tower crane operation conditions cannot be obtained in time.

None of the above can achieve better automatic path planning, so those skilled in the art urgently need to find a new technical solution to solve the above problems.

SUMMARY

In view of the technical problems in the prior art, the present invention provides an automatic hoisting and transporting method for a tower crane.

The present invention discloses an automatic hoisting and transporting method for a tower crane, the method including:

-   -   building a three-dimensional grid model for a construction site,         and generating a grid node set Φ₀;     -   generating an obstacle node set U₀ and a feasible area node set         Φ₁ according to the positions of the obstacles in the         construction site and the grid node set Φ₀;     -   obtaining coordinates of an initial node S and an end node G of         a hoisting and transporting operation in the three-dimensional         grid model;     -   planning a hoisting and transporting path from the initial node         S to the end node G according to the initial node S, the end         node G, the feasible area node set Φ₁ and a preset hoisting and         transporting path planning strategy, and generating         corresponding operating parameters;     -   controlling the tower crane to transport an object according to         the operating parameters, and calculating a swing range of the         hoisted and transported object and a swing arm at a current         position according to a preset swing range calculation strategy;     -   determining whether a collision may occur according to the swing         range and the obstacle node set U₀;     -   if not, controlling the tower crane to continue to transport the         object according to the hoisting and transporting path;     -   if yes, controlling the tower crane to be braked; and     -   predicting whether the tower crane may be overturned according         to a preset overturning calculation strategy during braking of         the tower crane.

The automatic hoisting and transporting method for the tower crane in the present invention replaces a manned driving mode. It takes the three-dimensional grid model of the construction site as the basis for hoisting and transporting path planning, modifies the data structure, which greatly shortening the calculation time, and improving the efficiency of path planning; by generating the obstacle node set, the relevant nodes can be avoided during path planning, so as to eliminate the problem of visual blind zones in manned driving and ensure that the object does not collide with the obstacle during hoisting and transporting, guaranteeing safe operation of the tower crane; the aerial hoisting and transporting path is planned according to the preset path planning strategy and the coordinates of the initial node and the end node of the hoisting and transporting operation, such that the heavy object is transported with higher efficiency under the condition of no collision, and the time and effort are saved; and whether the tower crane may be overturned is predicted according to the preset overturning calculation strategy during transportation, so as to prevent dangerous events from happening.

BRIEF DESCRIPTION OF DRAWINGS

In order to illustrate the embodiments of the present invention or the technical solutions in the prior art more clearly, the following briefly introduces the accompanying drawings that need to be used in the description of the embodiments or the prior art. Apparently, the accompanying drawings in the description below are merely some embodiments of the present invention. Those of ordinary skill in the art may also derive other accompanying drawings from these accompanying drawings without creative efforts.

FIG. 1 is a flowchart (one) of steps of an automatic hoisting and transporting method for a tower crane in an embodiment of the present invention;

FIG. 2 is a flowchart (two) of steps of an automatic hoisting and transporting method for a tower crane in an embodiment of the present invention; and

FIG. 3 is a flowchart (three) of steps of an automatic hoisting and transporting method for a tower crane in an embodiment of the present invention.

DETAILED DESCRIPTION OF EMBODIMENTS

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings of the present invention. Apparently, the described embodiments are merely a part, rather than all of the embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts fall within the scope of protection of the present invention.

As shown in FIG. 1 , an embodiment of the present invention discloses an automatic hoisting and transporting method for a tower crane, the method including:

Step S10: a three-dimensional grid model for a construction site is built, and a grid node set Φ₀ is generated.

As shown in FIG. 2 , the three-dimensional grid model for the construction site is built and may be implemented by the following steps:

Step S101: a plurality of video monitoring cameras are arranged around a building and the tower crane.

The video monitoring cameras in this embodiment are configured to acquire live images around the building and the tower crane. The number of the live images is not limited here. Preferably, it is the best implementation mode that may ensure that there is no shooting dead angle around the building and the tower crane.

Step S102: the video monitoring cameras are turned on when the tower crane retracts a hoist hook, the video monitoring cameras are controlled to continuously adjust the shooting angles and acquire the live images at the same time.

Step S103: the live images are preprocessed according to a preset image preprocessing strategy to generate preprocessed images.

An objective of the image preprocessing is to distinguish the objects from the background and reduce interference factors in subsequent steps. Main processing modes include image enhancement, increase in a contrast between the moving object and the background, image edge detection, etc. Features of the tower crane, a boom and the hoist hook are extracted to facilitate positioning of the moving object.

Step S104: the preprocessed images are evaluated according to a preset image effect evaluation strategy.

The preset image effect evaluation strategy may be set by those skilled in the art. For example, when an image with a chaotic background appears, it is not conducive to feature extraction, such that if the processing effect of the preprocessed images is unqualified, Step S105 is performed.

Step S105: angles of the video monitoring cameras are adjusted, lens magnifications and lens focal lengths are changed, and the live images are reacquired. Step S103 and Step S104 continue to be performed for preprocessing the live images and evaluating the preprocessed images.

If the processing effect of the preprocessed images is qualified, Step S106 is performed.

Step S106: the three-dimensional grid model for the construction site is built according to the preprocessed images, and elevations z₀ of grid nodes (x₀, y₀) are extracted under a preset plane grid accuracy.

In this step, the three-dimensional grid model for the construction site is built, coordinates of the grid nodes are determined, and the grid node set Φ₀ is correspondingly generated. Model building may be performed by model building methods such as oblique photography, three-dimensional laser scanning, etc. The plane grid accuracy is set by those skilled in the art. In view of the size of the overall model, it is more appropriate to set the plane grid accuracy to be 1 m.

A coordinate system is established in the three-dimensional grid model for the construction site. Since the boom of the tower crane rotates with the tower crane base as a center, the origin of the Cartesian coordinate of the construction site can be set to the tower crane base. In order to better reflect an actual working mode of the tower crane, the coordinate system with the center of the tower crane base as the origin in the three-dimensional grid model is transformed into a cylindrical coordinate system. If a coordinate of a node in the three-dimensional grid model is (x,y,z), then a coordinate thereof in the cylindrical coordinate system is (r,θ,h). The changes of the coordinate r, θ, h reflect amplitude change, rotation and hoisting motion of the tower crane, respectively. A transformational relationship between the coordinates is as follows:

$\left\{ {\begin{matrix} {r = \sqrt{x^{2} + y^{2}}} \\ {\theta = {\arctan\left( \frac{y}{x} \right)}} \\ {h = z} \end{matrix}.} \right.$

When the three-dimensional grid model is built in a cylindrical coordinate, this embodiment

further includes: (1) with a central axis of a tower body of the tower crane as a longitudinal axis of the cylindrical coordinate, angular coordinates θ are equally divided into a parts by a set step length; (2) the angular coordinates θ of all nodes are transformed into integers between 0 and a−1; and (3) with the angular coordinates of the nodes as indexes of a first-level list, radius coordinates r and height coordinates h of the nodes are taken as a second-level list. Preferably, the angular coordinates θ are equally divided into 360 parts by the set step length of 1°, the angular coordinates θ of all the nodes are transformed into the integers between 0 and 359, and then with the angular coordinates as the indexes of the first-level list, the radius coordinates r and height coordinates h of the nodes are stored in the second-level list. Namely:

${list} = {\begin{Bmatrix} \left\lbrack {\left( {r_{0,0},h_{0,0}} \right),\left( {r_{0,1},h_{0,1}} \right),\left( {r_{0,2},h_{0,2}} \right),\ldots} \right\rbrack \\ \left\lbrack {\left( {r_{1,0},h_{1,0}} \right),\left( {r_{1,1},h_{1,1}} \right),\left( {r_{1,2},h_{1,2}} \right),\ldots} \right\rbrack \\ \ldots \\ \left\lbrack {\left( {r_{359,0},h_{359,0}} \right),\left( {r_{359,1},h_{359,1}} \right),\left( {r_{359,2},h_{359,2}} \right),\ldots} \right\rbrack \end{Bmatrix}\begin{matrix} \rightarrow \\ \rightarrow \\ \rightarrow \\ \rightarrow \end{matrix}\begin{matrix} {\theta = 0} \\ {\theta = 1} \\ \ldots \\ {\theta = 359.} \end{matrix}}$

Step S107: the three-dimensional grid model for the construction site is updated at a fixed frequency.

After the three-dimensional grid model for the construction site is built, the model is always updated at the fixed frequency when subsequent steps are performed.

The three-dimensional grid model is built by the above method, and then the grid node set Φ₀ is generated in the following way:

A preset allowable amplitude change range [r_(min),r_(max)], allowable rotation range [θ_(min),θ_(max)], and allowable hoisting range [h_(min),h_(max)] of the tower crane are obtained. An operator may preset the allowable amplitude change range [r_(min),r_(max)], the allowable rotation range [θ_(min),θ_(max)], and the allowable hoisting range [h_(min),h_(max)] of the tower crane according to a structure of the tower crane.

m

n

P equal division is performed on the allowable amplitude change range [r_(min),r_(max)], the allowable rotation range [θ_(min),θ_(max)], and the allowable hoisting range [h_(min),h_(max)] of the tower crane, respectively.

The grid node set Φ₀ of nodes (r,θ,h) is generated as follows:

$\Phi_{0} = \left\{ {\left( {r_{i},\theta_{j},h_{k}} \right){❘{\begin{Bmatrix} {{r_{i} = {r_{\min} + {\frac{r_{\max} - r_{\min}}{m} \times i}}},} & {{i = 0},1,\ldots,m} \\ {{\theta_{j} = {\theta_{\min} + {\frac{\theta_{\max} - \theta_{\min}}{n} \times j}}},} & {{j = 0},1,\ldots,n} \\ {{h_{k} = {h_{\min} + {\frac{h_{\max} - h_{\min}}{p} \times k}}},} & {{k = 0},1,\ldots,p} \end{Bmatrix},}}} \right.$

where when m

n

P equal division is respectively performed on the allowable amplitude change range [r_(min),r_(max)], the allowable rotation range [θ_(min),θ_(max)], and the allowable hoisting range [h_(min),h_(max)] of the tower crane, n, P need to meet the following conditions:

$\left\{ {\begin{matrix} {{\Delta r} = {\frac{r_{\max} - r_{\min}}{m} \leq {\min\left( {1,l_{m}} \right)}}} \\ {{\Delta\theta} = {{\frac{\theta_{\max} - \theta_{\min}}{n} \times r_{\max}} \leq {\min\left( {1,l_{m}} \right)}}} \\ {{\Delta h} = {\frac{h_{\max} - h_{\min}}{p} \leq {\min\left( {1,l_{m}} \right)}}} \end{matrix}.} \right.$

In other words, it is required that the accuracy after grid division is not less than a smaller value between 1 m and a maximum distance l_(m), where l_(m) is the maximum distance between the edge of the object (or the hoist hook) and its centroid coordinate, suppose the centroid coordinate of the hoisted and transported object is (x_(m),y_(m),z_(m)), and the maximum distance between the edge of the hoisted and transported object and the centroid coordinate (x_(m),y_(m),z_(m)) is l_(m).

If implementation is on the basis of the angular coordinates of the nodes as the indexes of the first-level list in the above embodiment, then a value of n in this embodiment is 360, and the allowable rotation range [θ_(min),θ_(max)] is [0,359].

Step S20: an obstacle node set U₀ and a feasible area node set Φ₁ are generated according to the positions of the obstacles in the construction site and the grid node set Φ₀.

In order to ensure that the object hoisted by the tower crane during hoisting do not collide with the obstacle in the construction site, it is necessary to determine the obstacle node set U₀ according to the grid node set Φ₀ and the position, size and shape of the obstacle in the construction site, and then obstacle nodes present in the grid node set Φ₀ are removed to obtain the feasible area node set Φ₁ where the hoist hook and the heavy object may move freely. The feasible area node set Φ₁ is as follows:

$\Phi_{1} = {\Phi_{0} - \left\{ {\left( {r,\theta,h} \right){❘\begin{Bmatrix} {{❘{r - r_{u}}❘} < {l_{m} + l_{extra}}} \\ {{{{❘{\theta - \theta_{u}}❘} \times r} < {l_{m} + l_{extra}}},{\left( {r,\theta,h} \right) \in \Phi_{0}},{\left( {r_{u},\theta_{u},h_{u}} \right) \in U_{0}}} \\ {{❘{h - h_{u}}❘} < {l_{m} + l_{extra}}} \end{Bmatrix}}} \right.}$

where (r_(u),θ_(u),h_(u)) is a coordinate of the obstacle, U₀ is the obstacle node set, and l_(extra) is a set amount of redundancy. The amount of redundancy l_(extra) refers to that the operator sets a value for ensuring safety according to the law of tower crane operation, and its specific value is not limited here.

Step S30: coordinates of the initial node S and the end node G of a hoisting and transporting operation are obtained by means of the three-dimensional grid model.

In the Cartesian coordinate system:

The coordinate of the center of the tower crane base in the Cartesian coordinate system is set to be (α₀,b₀,c₀).

The coordinates of the initial point S and the end point G in the Cartesian coordinate system are obtained, and are respectively (α_(s),b_(s),c_(s)) and (α_(g),b_(g),c_(g))

The coordinates of the initial point S and the end point G in the Cartesian coordinate system are transformed into coordinates in the three-dimensional grid model, which are respectively an initial point S(x_(s),y_(s),z_(s)) and an end point G(x_(g),y_(g),z_(g)), where

$\left\{ {\begin{matrix} {x_{s} = {a_{s} - a_{0}}} \\ {y_{s} = {b_{s} - b_{0}}} \\ {z_{s} = {c_{s} - c_{0}}} \end{matrix},\left\{ {\begin{matrix} {x_{g} = {a_{g} - a_{0}}} \\ {y_{g} = {b_{g} - b_{0}}} \\ {z_{g} = {c_{g} - c_{0}}} \end{matrix}.} \right.} \right.$

Size information of the hoisted and transported object is obtained, and the centroid coordinate (x_(m),y_(m),z_(m)) of the hoisted and transported object and the maximum distance l_(m) between the edge of the hoisted and transported object and the centroid coordinate (x_(m),y_(m),z_(m)) are determined, or in the absence of the hoisted and transported object, a centroid coordinate of the hoist hook and a maximum distance between an edge of the hoist hook and the centroid coordinate are determined.

Alternatively, the coordinate (r_(s),θ_(s),h_(s)) of the initial point S and the coordinate (r_(G),θ_(G),h_(G)) of the end point G are correspondingly obtained in a mode of transformation between the Cartesian coordinate system and the cylindrical coordinate system in the foregoing embodiment.

Step S40: a hoisting and transporting path from the initial node S to the end node G is planned according to the initial node S, the end node G, the feasible area node set Φ₁ and a preset hoisting and transporting path planning strategy, and corresponding operating parameters are generated.

Specifically, in an embodiment of the present invention, the hoisting and transporting path planning strategy includes:

The feasible area node set Φ₁ is searched for nodes closest to the initial node S(x_(s),y_(s),z_(s)) and the end node G(x_(g),y_(g),z_(g)), where the nodes are respectively (r_(s),θ_(s),h_(s)) and (r_(g),θ_(g),h_(g)).

An area near the initial node S and the end node G is an operational area with high density of personnel, machines and tools, and obstacles, and the surrounding environment is constantly changing dynamically, such that when the heavy object is hoisted, it is not suitable to move horizontally in the area near the initial node S and the end node G. During hoisting and transporting, in this embodiment, the heavy object is vertically ascended to a certain height from the initial node S to reach a node S (hereinafter referred to as an aerial initial node S), is moved to a safety height node G (hereinafter referred to as an aerial end node G) over the end node G, and then is vertically descended to the end node G, so as to ensure the safety of operation.

The safety height may be set by means of a constant method or a ratio method. The constant method is to manually determine a constant value h_(safe) of the safety height according to an actual situation of the site; and the ratio method is to determine a safety ratio λ_(safe) and divide a space above the initial node or the end node according to the ratio. By taking the initial node S(r_(s),θ_(s),h_(s)) as an example, a coordinate of the aerial initial node S after vertical ascent is (r_(s),θ_(s),h _(s)), and the height h _(s) of the node S is h _(s)=h_(s)+m_(safe)·Δh, where m_(safe) is the number of grids for ascent, Δh is the height of a grid. A calculation method for m_(safe) includes:

(1) the constant method:

${m_{safe} = \left\lceil \frac{h_{safe}}{\Delta h} \right\rceil};$

and

(2) the ratio method:

${m_{safe} = \left\lceil {\lambda_{safe} \cdot \frac{h_{\max} - h}{\Delta h}} \right\rceil},$

where ┌ . . . ┐ is a round-up operator.

In addition, the preset safety height value is obtained, where the safety height value includes an ascent height value and a descent height value, the ascent height value and the descent height value are respectively h _(s)=h_(s)+m_(safe)·Δh and h _(g)=h_(g)+m_(safe)·Δh, m_(safe) is the number of grids for ascent or descent, and Δh is the height of one grid.

A reachable node set open list and an unconcerned node set close list are established. The former represents a set of reachable nodes to be checked, and the latter represents a set of nodes that no longer need to be concerned about.

The aerial initial node S(r_(s),θ_(s),h _(s)) is put into the reachable node set open list, nodes in the unconcerned node set close list are skipped, reachable nodes adjacent to the aerial initial node S in the feasible area node set Φ₁ are added to the reachable node set open list, and parent nodes of these nodes are set as S(r_(s),θ_(s),h _(s)).

The aerial initial node S(r_(s),θ_(s),h _(s)) is put into the unconcerned node set close list.

Cost values f(n)=g(n)+h(n) of all nodes in the reachable node set open list are calculated, where g(n) represents an actual cost from the aerial initial node S to a node n(r_(n),θ_(n),h _(n)), h(n) represents an estimated cost from the node n(r_(n),θ_(n),h_(n)) to the aerial end node G(r_(g),θ_(g),h _(g)), and h(n)=|r_(n)−r_(g)|+|θ_(n)−θ_(g)|+|h_(n)−h _(g)|. A node N with a minimum cost value f(n) is extracted from the reachable node set open list and put into the unconcerned node set close list; the nodes in the unconcerned node set close list are skipped, the feasible area node set Φ₁ is searched for all reachable nodes adjacent to the node N, and if the nodes are not in the reachable node set open list, the nodes are added to the reachable node set open list, and parent nodes of the nodes are set to be N; if the nodes are already in the reachable node set open list, whether actual costs g(n) from the node N to the nodes are less than previous values is calculated, and if yes, the parent nodes of the nodes are set to be N; and if not, any operation is not performed.

The previous step is repeated, until the aerial end node G(r_(g),θ_(g),h _(g)) is added to the reachable node set open list.

Starting from the aerial end node G(r_(g),θ_(g),h _(g)), moving is performed along the parent node of each of the nodes, and until the aerial initial node S(r_(s),θ_(s),h _(s)) is reached, an aerial hoisting and transporting path is formed.

The hoisting and transporting path is from the initial node S, the aerial initial node S, and the aerial end node G to the end node G.

Specifically, in another embodiment of the present invention, as shown in FIG. 3 , the hoisting and transporting path planning strategy includes:

S201: a reachable node set open list and an unconcerned node set close list are established.

The reachable node set open list and the unconcerned node set close list are established by the foregoing embodiment.

S202: the initial node S is put into the reachable node set open list, a total cost f(S) and an actual cost g(S) of the initial node S are set to be 0, and a parent node thereof is set as itself.

S203: in the reachable node set open list, a node n with a minimum total cost f(n) is selected, and the node n is deleted from the reachable node set open list, where a coordinate of the node n is (r_(n),θ_(n),h_(n)), the total cost of the node n is f(n)=g(n)+h(n) g(n) is the actual cost of the node n, h(n) is a heuristic function of the node n, h(n)=k₁(h_(mid)−h_(n))+k₂+k₃(|r_(n)−r_(G)|+|θ_(n)−θ_(G)|)+k₄|h_(n)−h_(G)|, k₁,k₂, k₃, k₄ are preset weight functions, and h_(mid) is a preset safety height value that needs to be ensured before wide-range horizontal motion.

Specifically, in this embodiment, a weight function k₁ is mainly used to control the path to move up first to a target height h_(mid) during hoisting. An expression of the weight function k₁ is as follows:

${k_{1}(n)} = \left\{ {\begin{matrix} {10,} & {{d\left( {n,S} \right)} < {\rho{and}h_{n}} < h_{mid}} \\ {0,} & {{d\left( {n,G} \right)} < \rho} \\ {1,} & {others} \end{matrix},} \right.$

where d(n,S) represents a Euclidean distance between the node n and the initial node S, d(n,G) represents a Euclidean distance between the node n and the end node G, and ρ is a preset radius range.

A weight function k₂ in this embodiment is mainly used to increase costs of nodes near the initial node and below the target height h_(mid) as a whole, so as to ensure smooth search for nodes outside the area after hoisting to the target height. When λ is set to be a constant at least an order of magnitude larger than d(S,G) then an expression of the weight function k₂ is as follows:

${k_{2}(n)} = \left\{ {\begin{matrix} {\lambda,} & {{d\left( {n,S} \right)} < {\rho{and}h_{n}} < h_{mid}} \\ {0,} & {others} \end{matrix},} \right.$

where d(S,G) represents a Euclidean distance between the initial node S and the end node G.

In this embodiment, a weight function k₃ is mainly used to control horizontal motion to the end node G. An expression of the weight function k₃ is as follows:

${k_{3}(n)} = \left\{ {\begin{matrix} {0,} & {{d\left( {n,S} \right)} < {\rho{and}h_{n}} < h_{mid}} \\ {1,} & {others} \end{matrix}.} \right.$

In this embodiment, a weight function k₄ is mainly used to control vertical motion to the end node G. A value of the weight function k₄ may be a constant of 1.

The safety height h_(mid) is comprehensively determined according to the height of the initial node S and the end node G and an allowable maximum ascent height h_(max) of the tower crane.

The safety height value is h_(mid)=max(h_(S),h_(G))+(h_(max)−max(h_(S),h_(G)))/2.

S204: a node m adjacent to the node n is obtained, and whether the node m belongs to the obstacle node set U₀ or the unconcerned node set close list is determined, where a coordinate of the node m is (r_(m),θ_(m),h_(m)).

In this step, whether the node M belongs to the obstacle node set or the unconcerned node set close list is determined by comparing a coordinate (r_(m),θ_(m),h_(m)) of the node m with coordinates of nodes in the obstacle node set U₀ and the unconcerned node set close list one by one. When the obstacle node set U₀ and the unconcerned node set close list are relatively large, the number of comparisons will be greatly increased, such that the comparison process is slowed down to reduce the efficiency of path planning. Especially for the obstacle node set U₀, due to the large work site of the tower crane, in order to ensure the path accuracy of the tower crane, the site is divided into space grids with a side length of each unit not greater than 1 m according to the previous steps, such that there are at least hundreds of thousands of obstacle nodes, resulting in a large number of comparisons.

For this, the embodiment of the present invention adopts a form of the foregoing nested list, including: the first-level list in the obstacle node set or the unconcerned node set close list is indexed with the angular coordinate θ_(m) of the node m to find the corresponding second-level list; and the corresponding second-level list is searched for the corresponding (r_(m),h_(m)). When whether the node m belongs to the obstacle node set U₀ or the unconcerned node set close list is queried, it is only necessary to query whether the θ_(m)-th second list has a corresponding coordinate (r_(m), h_(m)) with its angular coordinate θ_(m) as an index. By means of the above method, most of elements in the list may be directly excluded during comparison to greatly reduce the number of times of determination. Similarly, the radius coordinates r or the height coordinates h may also be used as the indexes, but in a work scenario of the tower crane, the angular coordinates θ can often contain more integers, so it is more recommended to use the angles as the indexes.

If the node m does not belong to the obstacle node set U₀ or the unconcerned node set close list, S205 is performed.

S205: whether the node m is already in the reachable node set open list.

S206: if the node m is not in the reachable node set open list, the node m is added to the reachable node set open list, the node n is set as a parent node of the node m, and a total cost f(m)=g(m)+h(m) of the node m is calculated, where g(m) represents an actual cost of moving from the initial node S to the node m via the parent node n thereof, g(m)=g(n)+|r_(m)−r_(n)·|+r_(n)·|θ_(m)−θ_(n)|+h_(m)−h_(n)|, h(m) is a heuristic function of the node m, and h(m)=k₁(h_(mid)−h_(m))+k₂+k₃(|r_(m)−r_(G)|+θ_(m)−θ_(G)|)+k₄|h_(m)−h_(G)|.

S207: if the node m is already in the reachable node set open list, a cost l(m,n)=g(n)+|r_(m)−r_(n)|+r_(n)·|θ_(m)−θ_(n)|+|h_(m)−h_(G)| of reaching the node m from the initial node S via a non-parent node n is calculated, the cost l(m,n) is compared with the actual cost g(m), and if l(m,n)<g(m) the node n is set as the parent node of the node m, the actual cost is set to be g(m)−l(m,n), and the total cost f(m) is updated.

The node n has multiple adjacent nodes m, so S208 is performed after all the adjacent nodes m of the node n are traversed via S204 to S207.

S208: the node n is added to the unconcerned node set close list.

S203 to S208 are repeated, until the node selected from the reachable node set open list is the end node G.

S209: starting from the aerial end node G, backtracking is performed along the parent node of each of the nodes, and until the initial node S is reached, backtracked nodes are connected in sequence to obtain a hoisting and transporting path.

According to the present invention, the corresponding operating parameters are generated after the hoisting and transporting path from the initial node S to the end node G is planned by the above listed embodiment.

Step S50: the tower crane is controlled to transport the object according to the operating parameters, and a swing range of the hoisted and transported object and a swing arm at a current position is calculated according to a preset swing range calculation strategy.

Based on an optical flow algorithm, a velocity vector is assigned to each pixel point in the image to form a motion vector field. When there is the moving object in the image, the object and the background move relatively. The velocity vector formed by the moving object must be different from the velocity vector of the background. A corresponding relationship present between a previous frame and a current frame is found by means of changes of changing pixels in an image sequence in a time domain and a correlation between adjacent frames, thereby calculating out motion information of the object between the adjacent frames, and predicting a motion trend of the object.

According to this, the position of the object may be calculated and the moving object is tracked, where an instantaneous motion velocity of the object in a certain frame is v₀, and an instantaneous motion velocity of the object in a next frame of image is v₁. According to a live image acquisition frequency of the video monitoring camera, a time interval t of two frames of images is obtained, and a motion acceleration

$a = \frac{v_{1} - v_{0}}{t}$

of the heavy object may be obtained. The velocity and acceleration of the object when it falls to the ground may be estimated by means of these changes to avoid collision and impact. When the heavy object reaches a target landing position, in the direction of a motion trajectory of the object, an acceleration is a≤0, and a velocity is v=0, such that the object falls to the ground smoothly without collision. When the current position H is less than a safety distance

${S = \frac{v^{2}}{2a}},$

a motor is controlled to increase a pull force, until H≥S. In order to ensure the safety, a is controlled to be as small as possible, namely, H=S.

According to the three-dimensional grid model for the construction site, the tower crane, the swing arm, the hoist hook and the object are set as a space A, and the building and surrounding buildings are set as a space B. When A ∩B=Ø, the tower crane is free from collision.

The motion of the object is decomposed into sub-motions in three directions. The object horizontally moves up or down in a vertical direction under the pull force F₁ of the tower crane. The object horizontally moves left or right under an action force F₂ of a trolley. The boom of the tower crane rotates in a horizontal plane under an action force F₃ of a rotation mechanism to drive the object to rotate on the horizontal plane. In linear motion, a resultant velocity and a resultant external force of the object must be kept parallel in direction, namely (G is the gravity of the object)

(F ₁ −G):F ₂ :F ₃=(x ₁ −x ₀):(y ₁ −y ₀):(z ₁ −z ₀)

Thus, the motion of the object should satisfy the following conditions:

${{\lim\frac{\left( {F_{1} - G} \right):F_{2}:F_{3}}{\left( {x_{1} - x_{0}} \right):\left( {y_{1} - y_{0}} \right):\left( {z_{1} - z_{0}} \right)}} = 1}{K = {{\lim\frac{\Delta\alpha}{\Delta s}} = 0}}$

where K is the curvature of the motion trajectory, Δs is the length of the trajectory, and Δα is a tangential angle between the initial node and the end node.

According to the predicted motion trend of the object, the action forces of the motor in the three directions are dynamically adjusted, such that the motion trajectory tends to an optimal path.

Specifically, the calculating a swing range of the object and a swing arm at a current position according to a preset swing range calculation strategy, includes:

An operation mode of the tower crane is identified, where the operation mode includes a hoisting mode, an amplitude change mode, a rotation mode, a rotation and amplitude change mode, a hoisting and amplitude change mode, a hoisting and rotation mode and a hoisting, rotation and amplitude change mode.

Braking parameters are calculated according to the operation mode, where the braking parameters include braking time of the swing arm, a braking distance of the swing arm, a braking angle of the swing arm, a braking distance of the object, a swing amplitude of the object, the length of a cable, an angle between the cable and the vertical direction, braking time of the trolley, and a braking distance of the trolley.

After the tower crane starts to operate, the motion of the object is tracked according to the optical flow algorithm, and dynamic coordinates and motion changes of the tower crane and the object are obtained, where real-time operating parameters at least include the length l₀ of the current cable, a velocity v_(c) of the cable, a rotation angle θ₀, an angular velocity ω of rotation, an amplitude r₀ of the trolley, an amplitude change velocity v_(r) of the trolley, a coordinate (r₁,θ₁,h₁) of the hoisted and transported object, a velocity v_(r) of the hoisted and transported object, the length r_(m) of the swing arm, the height h₀ of the swing arm, a hoisting load F_(c), and average accelerations α_(c), α and α_(r) during vertical locking, rotation locking and transverse locking, a node set U_(t) including grid coordinates (r₁,θ₁,h₁) of an outer contour of the construction site, etc.

The swing range of the object and the swing arm is calculated according to the braking parameters.

(1) The process for calculating the braking parameters and the swing range in the hoisting mode, includes:

In the case of only hoisting, the swing arm and the trolley are both stationary, and the object only operates in the vertical direction, such that after locking in the vertical direction, the braking distance

$S_{m} = \frac{v_{c}^{2}}{2a_{c}}$

of the object is calculated.

The swing range is W={(r₁,θ₁,h₁)|h∈[h₁, h₁+S_(m)]}.

(2) The process for calculating the braking parameters and the swing range in the amplitude change mode, includes: In the case of only amplitude change, the swing arm and the cable are both stationary, the object only moves in a vertical plane where the swing arm is located. After transverse locking, the braking time

$t = \frac{v_{r}}{a_{r}}$

of the trolley is calculated, the braking distance of the trolley is

$S_{c} = {\frac{v_{r}^{2}}{2a_{r}}.}$

The amplitude of the trolley after braking is r₀+S_(c). If it is assumed that the object still moves at the original velocity after braking, then the coordinate of the object after braking is (r₁+v₁t,θ₁,h₁+l₀(1−cos α₁)) where α₁ is an angle between the cable and the vertical direction after braking as follows:

$\alpha_{1} = {{arc}\tan\frac{r_{1} + {v_{1}t} - r_{0} - S_{c}}{l_{0}}}$

After braking, the object starts to do a simple pendulum motion, and a velocity component of the object perpendicular to the cable is v₁ cos α₁. Due to energy conservation, the ascent height

${\Delta h} = \frac{v_{1}^{2}\cos^{2}\alpha_{1}}{2g}$

of the object at a maximum swing amplitude is calculated, where g is an acceleration of gravity. An angle

$\alpha_{2} = {{arc}\cos\frac{{l_{0}\cos\alpha_{1}} - {\Delta h}}{l_{0}}}$

between the cable and the vertical direction is calculated. The coordinate of the object at the maximum swing amplitude is (r₀+S_(c)±l₀ sin α₂,θ₁,h₁+l₀ (1-cos α₂)). Thus, the swing range is W={(r₁,θ₁,h)|r∈[r₀+S_(c)−l₀ sin α₂, r₀+S_(c)+l₀ sin α₂],h∈[h₁,h₁+l₀ (1−cos α₂)]}.

(3) The process for calculating the braking parameters and the swing range in the swing mode, includes: in the case of rotation, the trolley and the cable are both stationary, and the cable pulls the object to move after the swing arm rotates. If rotation locking is performed, the braking time

$t = \frac{\omega}{\alpha}$

and the braking distance

$\theta_{d} = \frac{\omega^{2}}{2\alpha}$

of the swing arm are calculated, the braking angle of the swing arm after braking is θ₀+θ_(d), and the swing range of the swing arm is W₁={(r,θ,h₀)|r∈(0,r_(m)],θ∈(θ₀,θ₀+θ_(d)]}. If it is assumed that the object still moves at the original velocity after rotation braking, the coordinate (r₁,θ₁+ωt,h₁) of the object after braking is calculated, and after braking, the object does a conical pendulum motion with the trolley as a fixed end at an angular velocity of

${\omega^{\prime} = {\frac{r_{1}}{l_{0}\sin\varphi_{1}}\omega}},$

where φ₁ is an angle between the cable and the vertical direction during the conical pendulum motion.

According to force balance of the object in the vertical and horizontal directions, an equation

$\left\{ \begin{matrix} {{F\sin\varphi_{1}} = {{ml}_{0}\sin{\varphi_{1} \cdot \omega^{\prime 2}}}} \\ {{F\cos\varphi_{1}} = {mg}} \end{matrix} \right.$

is obtained. A value of φ₁ is solved by means of the equation, where F is the pull force of the cable.

φ₁ is

${\varphi_{1} = {{arc}{\cos\left( \frac{{- \lambda} + \sqrt{\lambda^{2} + 4}}{2} \right)}}},$

where λ is

${\lambda = \frac{l_{0}}{{gr}_{1}^{2}\omega^{2}}},$

and the swing range W₂ of the object is a plane of h=h₁ and a circle with (r₀,θ₀+θ_(d),h₁) as the center of circle and l₀ sin φ₁ as the radius, W₂={(r,θ,h₁)|r²−2rr₀ cos(θ−θ₀−θ_(d))+r₀ ²=I₀ ² sin²φ₁}.

A total swing range is W=W₁ ∪W₂.

(4) The process for calculating the braking parameters and the swing range in the rotation and amplitude change mode, includes:

In the case of rotation and amplitude change, if rotation locking and amplitude change locking are performed at the same time, the coordinate

$\left( {{r_{0} + \frac{v_{r}^{2}}{2a_{r}}},{\theta_{0} + \frac{\omega^{2}}{2\alpha}},h_{0}} \right)$

of the trolley after braking is calculated. The braking time

$t = \frac{\omega}{\alpha}$

and the braking distance

$\theta_{d} = \frac{\omega^{2}}{2\alpha}$

of the swing arm are calculated, the braking angle of the swing arm is θ₀+θ_(d), and the swing range of the swing arm is W₁={(r,θ,h₀)|r∈(0,r_(m)](θ₀,θ₀+θ_(d)]}. After braking, the object does the conical pendulum motion with the trolley as a fixed node, such that in order to improve the safety, v₁ before braking is taken as the motion velocity of the object. According to the force balance of the object in the vertical and horizontal directions, the following equation may be obtained:

$\left\{ {\begin{matrix} {{F\sin\varphi_{1}} = \frac{{mv}_{1}^{2}}{l_{0}\sin\varphi_{1}}} \\ {{F\cos\varphi_{1}} = {mg}} \end{matrix}.} \right.$

An angle φ₁ between the cable and the vertical direction is calculated according to the equation.

${\varphi_{1} = {{arc}{\cos\left( \frac{{- \lambda} + \sqrt{\lambda^{2} + 4}}{2} \right)}}},$

where λ is

${\lambda = \frac{v_{1}^{2}}{l_{0}g}},$

and the swing range W₂ of the object is a plane of h=h₁ and a circle with

$\left( {{r_{0} + \frac{v_{r}^{2}}{2a_{r}}},{\theta_{0} + \frac{\omega^{2}}{2\alpha}},h_{1}} \right)$

as the center of circle and l₀ sin φ₁ as the radius, namely,

$W_{2} = {\left\{ {\left. \left( {r,\theta,h_{1}} \right) \middle| {r^{2} - {2r{r\left( {r_{0} + \frac{v_{r}^{2}}{2a_{r}}} \right)}{\cos\left( {\theta - \theta_{0} - \frac{\omega^{2}}{2\alpha}} \right)}} + \left( {r_{0} + \frac{v_{r}^{2}}{2a_{r}}} \right)^{2}} \right. = {\int_{0}^{2}{\sin^{2}\varphi_{1}}}} \right\}.}$

A total swing range is W=W₁∪W₂.

(5) The process for calculating the braking parameters and the swing range in the hoisting and amplitude change mode, includes:

In the case of hoisting and amplitude change, if vertical locking and transverse locking are achieved at the same time, the length

$l_{0}^{\prime} = {l_{0} + \frac{v_{c}^{2}}{2a_{c}}}$

of the cable after braking is calculated.

The calculation method for the rest is similar to the amplitude change mode. If it is assumed that the object still moves forward at the original velocity when braking starts, the coordinate of the object after braking is as follows:

$\left( {{r_{1} + {v_{1}t}},\theta_{1},{h_{1} + {\frac{v_{c}^{2}}{2a_{c}}\cos\alpha_{1}} + {l_{0}^{\prime}\left( {1 - {\cos\alpha_{1}}} \right)}}} \right),$

where α₁ is an angle between the cable and the vertical direction after braking, and

$\alpha_{1} = {\arctan{\frac{r_{1} + {v_{1}t} - r_{0} - S_{c}}{l_{0}^{\prime}}.}}$

After braking, the object starts to do the simple pendulum motion, and the velocity component of the object perpendicular to the cable is v₁ cos α₁. Due to energy conservation, the ascent height

${\Delta h} = \frac{v_{1}^{2}\cos^{2}\alpha_{1}}{2g}$

of the object at the maximum swing amplitude is calculated, where g is the acceleration of gravity. The angle between the cable and the vertical direction is

$\alpha_{2} = {\arccos{\frac{{l_{0}^{\prime}\cos\alpha_{1}} - {\Delta h}}{l_{0}^{\prime}}.}}$

The coordinate of the object at the maximum swing amplitude is (r₀+S_(c)±l₀′ sin α₂,θ₁,h₁+l₀′(1−cos α2)). Thus, the swing range is as follows:

W={(r,θ ₁ ,h)|r∈[r ₀ +S _(c) −l ₀′ sin α₂ ,r ₀ +S _(c) +l ₀′ sin α₂],h∈[h ₁ ,h ₁ ,l ₀′(1−cos α₂)]}.

(6) The process for calculating the braking parameters and the swing range in the hoisting and rotation mode, includes:

In the case of hoisting and rotation, if vertical locking and transverse locking are achieved at the same time, the length

$l_{0}^{\prime} = {l_{0} + \frac{v_{c}^{2}}{2a_{c}}}$

of the cable after braking is calculated. The remaining process is close to the rotation mode. The braking time

$t = \frac{\omega}{\alpha}$

and the braking distance

$\theta_{d} = \frac{\omega^{2}}{2\alpha}$

of the swing arm are calculated, the braking angle of the swing arm is θ₀+θ_(d), and the swing range of the swing arm is W₁={(r,θ,h₀)|r∈(0,r_(m)],θ∈(θ₀,θ₀+θ_(d)]}.

If it is assumed that the object still moves forward at the original velocity after braking, the coordinate of the object after braking is

$\left( {r_{1},{\theta_{1} + {\omega t}},{h_{1} + \frac{v_{c}^{2}}{2a_{c}}}} \right).$

The object does the conical pendulum motion with the trolley as the fixed end at the angular velocity of

${\omega^{\prime} = {\frac{r_{1}}{l_{0}\sin\varphi_{1}}\omega}},$

where φ₁ is the angle between the cable and the vertical direction during the conical pendulum motion.

According to the force balance of the object in the vertical and horizontal directions, the equation

$\left\{ \begin{matrix} {{F\sin\varphi_{1}} = {ml_{0}^{\prime}\sin{\varphi_{1} \cdot \omega^{\prime 2}}}} \\ {{F\cos\varphi_{1}} = {mg}} \end{matrix} \right.$

is obtained. The value of φ₁ is solved according to the equation, where F is the pull force of the cable. φ₁ is

${\varphi_{1} = {\arccos\left( \frac{{- \lambda} + \sqrt{\lambda^{2} + 4}}{2} \right)}},$

where λ is

${\lambda = \frac{l_{0}^{\prime}}{gr_{1}^{2}\omega^{2}}},$

and the swing range W₂ of the object is a plane of

$h = {h_{1} + \frac{v_{c}^{2}}{2a_{c}}}$

and a circle with

$\left( {r_{1},{\theta_{1} + \theta_{d}},{h_{1} + \frac{v_{c}^{2}}{2a_{c}}}} \right)$

as the center of circle and l₀′ sin φ as the radius, namely,

$W_{2} = {\left\{ {\left( {r,\theta,{h_{1} + \frac{v_{c}^{2}}{2a_{c}}}} \right){❘{{r^{2} - {2rr_{0}\cos\left( {\theta - \theta_{0} - \theta_{d}} \right)} + r_{0}^{2}} = {l_{0}^{\prime 2}\sin^{2}\varphi_{1}}}}} \right\}.}$

A total swing range is W=W₁∪W₂

(7) The process for calculating the braking parameters and the swing range in the hoisting, rotation and amplitude change mode, includes:

In the case where three motions of hoisting, rotation and amplitude change occur at the same time, the coordinate

$\left( {{r_{0} + \frac{v_{r}^{2}}{2a_{r}}},{\theta_{0} + \frac{\omega^{2}}{2\alpha}},h_{0}} \right)$

of the trolley after braking is calculated; the length

$l_{0}^{\prime} = {l_{0} + \frac{v_{c}^{2}}{2a_{c}}}$

of the cable after braking is calculated; and the braking time

$t = \frac{\omega}{\alpha}$

and the braking distance

$\theta_{d} = \frac{\omega^{2}}{2\alpha}$

of the swing arm are calculated, the braking angle of the swing arm is θ₀+θ_(d), and the swing range of the swing arm is W₁={(r,θ,h₀)|r∈(0,r_(m)],θ∈(θ₀,θ₀+θ_(d)]}. After braking, the object does the conical pendulum motion with the trolley as the fixed node, such that in order to improve the safety, v₁ before braking is taken as the motion velocity of the object. According to the force balance of the object in the vertical and horizontal directions, the following equation may be obtained:

$\left\{ {\begin{matrix} {{F\sin\varphi_{1}} = \frac{mv_{1}^{2}}{l_{0}^{\prime}\sin\varphi_{1}}} \\ {{F\cos\varphi_{1}} = {mg}} \end{matrix}.} \right.$

An angle φ₁ between the cable and the vertical direction is calculated according to the equation.

${\varphi_{1} = {{arc}\cos\left( \frac{{- \lambda} + \sqrt{\lambda^{2} + 4}}{2} \right)}},$

wherein λ is

${\lambda = \frac{v_{1}^{2}}{l_{0}^{\prime}g}},$

and the swing range W₂ of the object is a plane of

$h = {h_{1} + \frac{v_{c}^{2}}{2a_{c}}}$

and a circle with

$\left( {{r_{0} + \frac{v_{r}^{2}}{2a_{r}}},{\theta_{0} + \frac{\omega^{2}}{2\alpha}},{h_{1} + \frac{v_{c}^{2}}{2a_{c}}}} \right)$

as the center of circle and l₀′ sin φ as the radius, namely,

$W_{2} = {\left\{ {\left( {r,\theta,{h_{1} + \frac{v_{c}^{2}}{2a_{c}}}} \right){❘{{r^{2} - {2{r\left( {r_{0} + \frac{v_{r}^{2}}{2a_{r}}} \right)}\cos\left( {\theta - \theta_{0} - \theta_{d}} \right)} + \left( {r_{0} + \frac{v_{r}^{2}}{2a_{r}}} \right)^{2}} = {l_{0}^{\prime 2}\sin^{2}\varphi_{1}}}}} \right\}.}$

A total swing range is W=W₁∪W₂.

Step S60: whether a collision may occur is determined according to the swing range and the obstacle node set U₀

It includes: a determination condition is set as W_(s)∩U_(t)≠Ø, where W_(s) is an updated swing range after a safety margin is added to the swing range W,

W_(s){(r,θ,h)|(r cos θ−r_(i) cos θ_(i))²+(r sin θ−r_(i) sin θ^(i))²+(h−h_(i))²≤r_(s) ²,(r_(i),θ_(i),h_(i))∈W}, and

U_(t) is a node set including grid coordinates (r_(t),θ_(t),h_(t)) of an outer contour of the construction site.

If an intersection set of the node set U_(t) and the swing range W_(s) is a null set, it is considered safe, otherwise it is considered that the collision may occur.

Step S70: if not, the tower crane is controlled to continue to transport the object according to the hoisting and transporting path.

During transporting, Steps S50 and S60 continue to be performed always at a set frequency, and until the tower crane transports the object to a coordinate of a predetermined node, the object has a speed of v=0 and an acceleration of α≤0

Step S80: if yes, the tower crane is controlled to be braked.

According to the operation mode such as the hoisting mode, the amplitude change mode, the rotation mode, the rotation and amplitude change mode, the hoisting and amplitude change mode, the hoisting and rotation mode and the hoisting, rotation and amplitude change mode, vertical locking, transverse locking and rotation locking are correspondingly performed to brake the tower crane.

Step S90: whether the tower crane may be overturned is predicted according to a preset overturning calculation strategy during braking of the tower crane.

Specifically, the overturning calculation strategy includes:

when a vertical maximum braking acceleration during braking is set to be α _(c), a maximum hoisting moment during braking is

${\overset{\_}{M} = {\left( {F_{c} + {\frac{F_{c}}{g} \cdot {\overset{¯}{a}}_{c}}} \right) \cdot \left( {r_{0} + \frac{v_{r}^{2}}{2a_{r}}} \right)}},$

and when a maximum moment of the tower crane is M_(max), an overturning determination condition is λM>M_(max), where λ is a safety factor, and λ is greater than 1.

The automatic hoisting and transporting method for the tower crane in the present invention replaces a manned driving mode, and plans the hoisting and transporting path on the basis of the three-dimensional grid model for the construction site, thereby optimizing an aggregate data structure, greatly shortening the calculation time, and improving the efficiency of path planning; by generating the obstacle node set, the problem of visual blind zones in manned driving is avoided, and relevant nodes can be avoided during path planning, so as to ensure that the object does not collide with the obstacle during hoisting and transporting to guarantee safe operation of the tower crane; the aerial hoisting and transporting path is planned according to the preset path planning strategy and the coordinates of the initial node and the end node of hoisting and transporting operation, such that the heavy object is transported with higher efficiency under the condition of no collision, and the time and effort are saved; and whether the tower crane may be overturned is predicted according to the preset overturning calculation strategy during transportation, so as to prevent dangerous events from happening.

The present invention is further described above with the help of specific embodiments, but it should be understood that the specific description here should not be construed as a limitation to the spirit and scope of the present invention. Various modifications made to the above-mentioned embodiments by those of ordinary skill in the art upon reading this specification fall within the scope of protection of the present invention. 

1. An automatic hoisting and transporting method for a tower crane, the method comprising: building a three-dimensional grid model for a construction site, and generating a grid node set Φ₀; generating an obstacle node set U₀ and a feasible area node set Φ₁ according to a position of an obstacle in the construction site and the grid node set Φ₀; obtaining coordinates of an initial node S and an end node G by means of the three-dimensional grid model; planning a hoisting and transporting path from the initial node S to the end node G according to the initial node S, the end node G, the feasible area node set Φ₁ and a preset hoisting and transporting path planning strategy, and generating corresponding operating parameters; controlling the tower crane to transport an object according to the operating parameters, and calculating a swing range of the hoisted and transported object and a swing arm at a current position according to a preset swing range calculation strategy; determining whether a collision may occur according to the swing range and the obstacle node set U₀; if not, controlling the tower crane to continue to transport the object according to the hoisting and transporting path; if yes, controlling the tower crane to be braked; and predicting whether the tower crane may be overturned according to a preset overturning calculation strategy during braking of the tower crane.
 2. The automatic hoisting and transporting method for a tower crane according to claim 1, wherein the obtaining coordinates of an initial node S and an end node G by means of the three-dimensional grid model, comprises: setting a coordinate of the center of a tower crane base in a Cartesian coordinate system to be (α₀,b₀,c₀); obtaining the coordinates of the initial point S and the end point G in the Cartesian coordinate system, the coordinates being respectively (α_(s),b_(s),c_(s)) and (α_(g),b_(g), c_(g)); transforming the coordinates of the initial point S and the end point G in the Cartesian coordinate system into coordinates in the three-dimensional grid model, the coordinates in the three-dimensional grid model being respectively an initial point S(x_(s),y_(s),z_(s)) and an end point G(x_(g),y_(g),z_(g)) wherein $\left\{ {\begin{matrix} {x_{s} = {a_{s} - a_{0}}} \\ {y_{s} = {b_{s} - b_{0}}} \\ {z_{s} = {c_{s} - c_{0}}} \end{matrix},\left\{ {\begin{matrix} {x_{g} = {a_{g} - a_{0}}} \\ {y_{g} = {b_{g} - b_{0}}} \\ {z_{g} = {c_{g} - c_{0}}} \end{matrix};} \right.} \right.$ and obtaining size information of the hoisted and transported object, and determining a centroid coordinate (x_(m)y_(m),z_(m)) of the hoisted and transported object and a maximum distance l_(m) between an edge of the hoisted and transported object and the centroid coordinate (x_(m),y_(m),z_(m)), or in the absence of the hoisted and transported object, determining a centroid coordinate of a hoist hook and a maximum distance between an edge of the hoist hook and the centroid coordinate.
 3. The automatic hoisting and transporting method for a tower crane according to claim 2, wherein the building a three-dimensional grid model for a construction site, and generating a grid node set Φ₀, comprises: obtaining a preset allowable amplitude change range [r_(min),r_(max)], allowable rotation range [θ_(min),θ_(max)], and allowable hoisting range, [h_(min),h_(max)] of the tower crane; respectively performing m

n

P equal division on the allowable amplitude change range [r_(min),r_(max)], the allowable rotation range [θ_(min),θ_(max)], and the allowable hoisting range [h_(min),h_(max)] of the tower crane; and generating the grid node set Φ₀ of nodes (r,θ,h) as follows: $\Phi_{0} = \left\{ {{\left( {r_{i},\theta_{j},h_{k}} \right)❘\begin{Bmatrix} {{r_{i} = {r_{\min} + {\frac{r_{\max} - r_{\min}}{m} \times i}}},{i = 0},1,\ldots,m} \\ {{\theta_{j} = {\theta_{\min} + {\frac{\theta_{\max} - \theta_{\min}}{n} \times j}}},{j = 0},1,\ldots,n} \\ {{h_{k} = {h_{\min} + {\frac{h_{\max} - h_{\min}}{p} \times k}}},{k = 0},1,\ldots,p} \end{Bmatrix}},} \right.$ wherein when m

n

p equal division is respectively performed on the allowable amplitude change range [r_(min),r_(max)], the allowable rotation range [θ_(min),θ_(max)], and the allowable hoisting range [h_(min),h_(max)] of the tower crane, m

n

p need to meet the following conditions: $\left\{ {\begin{matrix} {{\Delta r} = {\frac{r_{\max} - r_{\min}}{m} \leq {\min\left( {1,l_{m}} \right)}}} \\ {{\Delta\theta} = {{\frac{\theta_{\max} - \theta_{\min}}{n} \times r_{\max}} \leq {\min\left( {1,l_{m}} \right)}}} \\ {{\Delta h} = {\frac{h_{\max} - h_{\min}}{p} \leq {\min\left( {1,l_{m}} \right)}}} \end{matrix}.} \right.$
 4. The automatic hoisting and transporting method for a tower crane according to claim 3, wherein the feasible area node set Φ₁ is as follows: $\Phi_{1} = {{\Phi_{0} - \left( {r,\theta,h} \right)}❘\left\{ {\begin{matrix} {{❘{r - r_{u}}❘} < {l_{m} + l_{extra}}} \\ {{{❘{\theta - \theta_{u}}❘} \times r} < {l_{m} + l_{extra}}} \\ {{❘{h - h_{u}}❘} < {l_{m} + l_{extra}}} \end{matrix},{\left( {r,\theta,h} \right) \in \Phi_{0}},{\left( {r_{u},\theta_{u},h_{u}} \right) \in U_{0}}} \right\}}$ wherein (r_(u),θ_(u),h_(u)) is a coordinate of an obstacle, U₀ is the obstacle node set, and l_(extra) is a set amount of redundancy.
 5. The automatic hoisting and transporting method for a tower crane according to claim 4, wherein a hoisting and transporting path planning strategy comprises: searching the feasible area node set Φ₁ for nodes closest to the initial node S(x_(s),y_(s),z_(s)) and the end node G(x_(g),y_(g),z_(g)), the nodes being respectively (r_(s),θ_(s),h_(s)) and (r_(g),θ_(g),h_(g)); obtaining a preset safety height value, the safety height value comprising an ascent height value and a descent height value, the ascent height value and the descent height value being respectively h _(s)=h_(s)+m_(safe)·Δh, and h _(g)=h_(g)+m_(safe)·Δh, wherein m_(safe) is the number of grids for ascent or descent, and Δh is the height of one grid; establishing a reachable node set and an unconcerned node set; putting an aerial initial node S(r_(s),θ_(s),h _(s)) into the reachable node set, skipping nodes in the unconcerned node set, adding reachable nodes adjacent to the aerial initial node S in the feasible area node set Φ₁ to the reachable node set, and setting parent nodes of these nodes as S(r_(s),θ_(s),h _(s)); putting the aerial initial node S(r_(s),θ_(s),h _(s)) into the unconcerned node set; calculating cost values f(n)=g(n)+h(n) of all nodes in the reachable node set, wherein g(n) represents an actual cost from the aerial initial node S to a node n(r_(n),θ_(n),h_(n)) h(n) represents an estimated cost from the node n(r_(n),θ_(n),h_(n)) to an aerial end node G(r_(g),θ_(g),h _(g)), and h(n)=|r_(n)−r_(g)|+θ_(n)−θ_(g)|+|h_(n)−h _(g)|; extracting a node N with a minimum cost value f(n) from the reachable node set, and putting the node N into the unconcerned node set; skipping the nodes in the unconcerned node set, searching the feasible area node set Φ₁ for all reachable nodes adjacent to the node N, and if the nodes are not in the reachable node set, adding the nodes to the reachable node set, and setting parent nodes of the nodes to be N; if the nodes are already in the reachable node set, calculating whether actual costs g(n) from the node N to the nodes are less than previous values, and if yes, setting the parent nodes of the nodes to be N; repeating the previous step, until the aerial end node G(r_(g),θ_(g),h _(g)), is added to the reachable node set; and starting from the aerial end node G(r_(g),θ_(g),h _(g)), moving along the parent node of each of the nodes, and until the aerial initial node S(r_(s),θ_(s),h _(s)) is reached, forming an aerial hoisting and transporting path, the hoisting and transporting path being from the initial node S, the aerial initial node S, and the aerial end node G to the end node G.
 6. The automatic hoisting and transporting method for a tower crane according to claim 1, wherein the building a three-dimensional grid model for a construction site, and generating a grid node set Φ₀, comprises: building a three-dimensional grid model for a construction site in a cylindrical coordinate system; generating the grid node set Φ₀ of nodes (r,θ,h); with a central axis of a tower body of the tower crane α_(s) a longitudinal axis of a cylindrical coordinate, equally dividing angular coordinates θ into α parts by a set step length; transforming the angular coordinates θ of all the nodes into integers between 0 and α−1; and with the angular coordinates of the nodes as indexes of a first-level list, taking radius coordinates r and height coordinates h of the nodes as a second-level list.
 7. The automatic hoisting and transporting method for a tower crane according to claim 6, wherein a hoisting and transporting path planning strategy comprises: establishing a reachable node set and an unconcerned node set; putting the initial node S into the reachable node set, setting a total cost f(s) and an actual cost g(s) of the initial node S to be 0, and setting a parent node thereof as itself, in the reachable node set, selecting a node n with a minimum total cost f(n), and deleting the node n from the reachable node set, wherein a coordinate of the node n is (r_(n),θ_(n),h_(n)), the total cost of the node n is f(n)=g(n)+h(n) g(n) is the actual cost of the node n, h(n) is a heuristic function of the node n, h(n)=k₁(h_(mid)−h_(n))+k₂+k₃(|r_(n)−r_(G)|+|θ_(n)−θ_(G)|)+k₄|h_(n)−h_(G)|, k₁,k₂, k₃, k₄ are preset weight functions, and h_(mid) is a preset safety height value that needs to be ensured before wide-range horizontal motion; obtaining a node m adjacent to the node n, and determining whether the node m belongs to the obstacle node set or the unconcerned node set, wherein a coordinate of the node m is (r_(m),θ_(m),h_(m)); if not, determining whether the node m is already in the reachable node set; if the node m is not in the reachable node set, adding the node m to the reachable node set, setting the node n as a parent node of the node m, and calculating a total cost f(m)=g(m)+h(m) of the node m, wherein g(m) represents an actual cost of moving from the initial node S to the node m via the parent node n thereof, g(m)=g(n)+|r_(m)−r_(n)|+r_(n)·|θ_(m)−θ_(n)|, |h_(m)−h_(n)|, h(m) is a heuristic function of the node m, and h(m)=k₁(h_(mid)−h_(m))+k₂+k₃|r_(m)−r_(G)|+θ_(m)−θ_(G))+k₄|h_(m)−h_(G)|; if the node m is already in the reachable node set, calculating a cost l(m,n)=g(n)+|r_(m)−r_(n)|+r_(n)·|θ_(m)−θ_(n)|, |h_(m)−h_(n)|, of reaching the node m from the initial node S via a non-parent node n, comparing the cost l(m,n) with the actual cost g(m), and if l(m,n)<g(m) setting the node n as the parent node of the node m, setting the actual cost g(m)=l(m,n), and updating the total cost (m); determining whether all adjacent nodes m of the node n are subjected to operation of the above steps, if yes, adding the node n to the unconcerned node set, and if not, determining whether other adjacent nodes m belong to the obstacle node set U₀ or the unconcerned node set, and performing subsequent steps; after traversing all the adjacent nodes m of the node n, adding the node n to the unconcerned node set; repeating the above steps, until the node selected from the reachable node set is the end node G; and starting from the aerial end node G, backtracking along the parent node of each of the nodes, and until the initial node S is reached, connecting backtracked nodes in sequence to obtain the hoisting and transporting path.
 8. The automatic hoisting and transporting method for a tower crane according to claim 7, wherein the determining whether the node m belongs to the obstacle node set or the unconcerned node set, comprises: indexing the first-level list in the obstacle node set U₀ or the unconcerned node set with an angular coordinate θ_(m) of the node m to find the corresponding second-level list; and searching the corresponding second-level list for corresponding (r_(m),h_(m)).
 9. The automatic hoisting and transporting method for a tower crane according to claim 8, wherein an expression of a weight function k₁ is as follows: ${k_{1}(n)} = \left\{ {\begin{matrix} {10,} & {{d\left( {n,S} \right)} < {\rho{and}h_{n}} < h_{mid}} \\ {0,} & {{d\left( {n,G} \right)} < \rho} \\ {1,} & {others} \end{matrix},} \right.$ wherein d(n,S) represents a Euclidean distance between the node n and the initial node S d(n,G) represents a Euclidean distance between the node n and the end node G, and P is a preset radius range.
 10. The automatic hoisting and transporting method for a tower crane according to claim 9, wherein an expression of a weight function k₂ is as follows: ${k_{2}(n)} = \left\{ {\begin{matrix} {\lambda,} & {{d\left( {n,S} \right)} < {\rho{and}h_{n}} < h_{mid}} \\ {0,} & {others} \end{matrix},} \right.$ wherein λ is a constant greater than one order of magnitude of d(S,G), and d(S,G) represents a Euclidean distance between the initial node S and the end node G; an expression of a weight function k₃ is as follows: ${k_{3}(n)} = \left\{ {\begin{matrix} {0,} & {{d\left( {n,S} \right)} < {\rho{and}h_{n}} < h_{mid}} \\ {1,} & {others} \end{matrix};} \right.$  and a weight function is equal to a constant of others
 1. 11. The automatic hoisting and transporting method for a tower crane according to claim 10, wherein the safety height value is α_(s) follows: h _(mid)=max(h _(s) ,h _(G))+(h _(max)−max(h _(s) ,h _(G)))/2, wherein h_(max) is an allowable maximum ascent height of the tower crane.
 12. The automatic hoisting and transporting method for a tower crane according to claim 1, wherein the calculating a swing range of the object and a swing arm at a current position according to a preset swing range calculation strategy, comprises: identifying an operation mode of the tower crane, the operation mode comprising a hoisting mode, an amplitude change mode, a rotation mode, a rotation and amplitude change mode, a hoisting and amplitude change mode, a hoisting and rotation mode and a hoisting, rotation and amplitude change mode; calculating braking parameters according to the operation mode, the braking parameters comprising braking time of the swing arm, a braking distance of the swing arm, a braking angle of the swing arm, a braking distance of the object, a swing amplitude of the object, the length of a cable, an angle between the cable and a vertical direction, braking time of a trolley, and a braking distance of the trolley; and calculating the swing range of the object and the swing arm according to the braking parameters.
 13. The automatic hoisting and transporting method for a tower crane according to claim 12, wherein the calculating the braking parameters and the swing range in the hoisting mode, comprises: calculating a braking distance $S_{m} = \frac{v_{c}^{2}}{2a_{c}}$  of the hoisted and transported object; v_(c) being a velocity of the cable, and α_(c) being an average acceleration during vertical locking; the swing range being W={(r₁,θ₁,h)|h∈[h₁,h₁+S_(m)]}; and (r₁,θ₁,h₁) being a coordinate of the hoisted and transported object; the calculating the braking parameters and the swing range in the amplitude change mode, comprises: calculating braking time $t = \frac{v_{r}}{a_{r}}$  of the trolley, a braking distance of the trolley being ${S_{c} = \frac{v_{r}^{2}}{2a_{r}}};$  v_(r) being an amplitude change velocity of the trolley, and α_(r) being an average acceleration during transverse locking; a coordinate of the object after braking being (r₁+v₁t, θ₁,h₁+l₀(1−cos α₁)), wherein v₁ is a velocity of the hoisted and transported object, l₀ is the length of the current cable, α₁ is an angle between the cable and the vertical direction after braking, ${\alpha_{1} = {\arctan\frac{r_{1} + {v_{1}t} - r_{0} - S_{c}}{l_{0}}}},$ and r₀ is an amplitude of the trolley; a velocity component of the object perpendicular to the cable being v₁ cos α₁, calculating an ascent height ${\Delta h} = \frac{v_{1}^{2}\cos^{2}\alpha_{1}}{2g}$  of the object, g being a gravitational acceleration; calculating an angle $\alpha_{2} = {\arccos\frac{{l_{0}\cos\alpha_{1}} - {\Delta h}}{l_{0}}}$  between the cable and the vertical direction; a coordinate of the object at a maximum swing amplitude being (r₀+S_(c)±l₀ sin α₂,θ₁h₁+l₀ (1−cos α₂)); and the swing range being α_(s) follows: W={(r,θ₁,h)|r∈[r₀+S_(c)−l₀ sin α₂, r₀+S_(c)+l₀ sin α₂],h∈[h₁,h₁+l₀(1−cos α₂)]}; and the calculating the braking parameters and the swing range in the rotation mode, comprises: calculating braking time $t = \frac{\omega}{\alpha}$  and the braking distance $\theta_{d} = \frac{\omega^{2}}{2\alpha}$  of the swing arm, the braking angle of the swing arm being θ₀+θ_(d); ω being an angular velocity of rotation, α being an average acceleration during rotation locking, and θ₀ being a rotation angle; the swing range of the swing arm being W₁={(r,θ,h₀) r∈(0,r_(m)],θ∈(θ₀,θ₀+O_(d)]} r_(m) being the length of the swing arm, and h₀ being the height of the swing arm; calculating a coordinate (r₁,θ₁+ωt,h₁) of the object, the object doing a conical pendulum motion with the trolley α_(s) a fixed end at an angular velocity of ${\omega^{\prime} = {\frac{r_{1}}{l_{0}\sin\varphi_{1}}\omega}},$  wherein φ₁ is an angle between the cable and the vertical direction during the conical pendulum motion; solving a value of φ₁ according to an equation $\left\{ {\begin{matrix} {{F\sin\varphi_{1}} = {{ml}_{0}\sin{\varphi_{1} \cdot \omega^{\prime 2}}}} \\ {{F\cos\varphi_{1}} = {mg}} \end{matrix},} \right.$  wherein F is a pull force of the cable; φ₁ being ${\varphi_{1} = {\arccos\left( \frac{{- \lambda} + \sqrt{\lambda^{2} + 4}}{2} \right)}},$  wherein λ is ${\lambda = \frac{l_{0}}{{gr}_{1}^{2}\omega^{2}}},$  and the swing range w₂ of the object is a plane of h=h₁ and a circle with (r₀,θ₀+θ^(d),h₁) as the center of circle and l₀ sin as the radius, namely, W₂={r,θ,h₁)|r²−2rr₀ cos(θ−θ₀−O_(d))−r₀ ²=l₀ ² sin ²φ₁}; and a total swing range being W=W₁ ∪W₂.
 14. The automatic hoisting and transporting method for a tower crane according to claim 13, wherein the calculating the braking parameters and the swing range in the hoisting, rotation and amplitude change mode, comprises: calculating a coordinate $\left( {{r_{0} + \frac{v_{r}^{2}}{2a_{r}}},{\theta_{0} + \frac{\omega^{2}}{2\alpha}},h_{0}} \right)$  of the trolley after braking; calculating the length $l_{0}^{\prime} = {l_{0} + \frac{v_{c}^{2}}{2a_{c}}}$  of the cable after braking; calculating the braking time $t = \frac{\omega}{\alpha}$  and the braking distance $\theta_{d} = \frac{\omega^{2}}{2\alpha}$ of the swing arm, the braking angle of the swing arm being θ₀+θ_(d), and the swing range of the swing arm being W₁={(r,θ,h₀)|r∈(0,r_(m)]θ∈(θ₀,θ₀+θ_(d)]}; calculating an angle φ₁ between the cable and the vertical direction according to an equation $\left\{ {\begin{matrix} {{F\sin\varphi_{1}} = \frac{{mv}_{1}^{2}}{l_{0}^{\prime}\sin\varphi_{1}}} \\ {{F\cos\varphi_{1}} = {mg}} \end{matrix},} \right.$ ${\varphi_{1} = {\arccos\left( \frac{{- \lambda} + \sqrt{\lambda^{2} + 4}}{2} \right)}},$ wherein λ is ${\lambda = \frac{v_{1}^{2}}{l_{0}^{\prime}g}},$  and the swing range w₂ of the object is a plane of $h = {h_{1} + \frac{v_{c}^{2}}{2a_{c}}}$  and a circle with $\left( {{r_{0} + \frac{v_{r}^{2}}{2a_{r}}},{\theta_{0} + \frac{\omega^{2}}{2\alpha}},{h_{1} + \frac{v_{c}^{2}}{2a_{c}}}} \right)$  as the center of circle and l₀′ sin φ as the radius, namely, ${W_{2} = \left\{ {{\left( {r,\theta,{h_{1} + \frac{v_{c}^{2}}{2a_{c}}}} \right)❘{r^{2} - {2{r\left( {r_{0} + \frac{v_{r}^{2}}{2a_{r}}} \right)}{\cos\left( {\theta - \theta_{0} - \theta_{d}} \right)}} + \left( {r_{0} + \frac{v_{r}^{2}}{2a_{r}}} \right)^{2}}} = {l_{0}^{\prime_{2}}\sin^{2}\varphi_{1}}} \right\}};$ and a total swing range being W=W₁ ∪W₂.
 15. The automatic hoisting and transporting method for a tower crane according to claim 14, wherein the determining whether a collision may occur according to the swing range and the obstacle node set U₀, comprises: setting a determination condition W_(s) ∩U_(t)≠Ø, wherein W_(s) an updated swing range after a safety margin is added to the swing range W, W_(s)={(r,θ,h)(r cos θ−r_(i) cos θ_(i))²+(r sin θ_(i)−r_(i) sin θ_(i))²+(h−h_(i))²≤r_(s) ², (r_(i),θ_(i),h_(i)) ∈W}, U_(t) is a node set comprising grid coordinates (r_(t),θ_(t),h_(t)) of an outer contour of the construction site.
 16. The automatic hoisting and transporting method for a tower crane according to claim 15, wherein the overturning calculation strategy comprises: when a vertical maximum braking acceleration during braking is set to be α _(c), a maximum hoisting moment during braking is ${\overset{\_}{M} = {\left( {F_{c} + {\frac{F_{c}}{g} \cdot {\overset{\_}{a}}_{c}}} \right) \cdot \left( {r_{0} + \frac{v_{r}^{2}}{2a_{r}}} \right)}},$  and when a maximum moment of the tower crane is M_(max) an overturning determination condition is λM>M_(max), wherein λ is a safety factor, and λ is greater than
 1. 